Forward Secrecy in Password-Only Key Exchange Protocols

Password-only authenticated key exchange (PAKE) protocols are designed to be secure even when users choose short, easilyguessed passwords. Security requires, in particular, that the protocol cannot be broken by an o -line dictionary attack in which an adversary enumerates all possible passwords in an attempt to determine the correct one based on previously-viewed transcripts. Recently, provably-secure protocols for PAKE were given in the idealized random oracle/ideal cipher models [2, 8, 19] and in the standard model based on general assumptions [11] or the DDH assumption [14]. The latter protocol (the KOY protocol) is currently the only known efcient solution based on standard assumptions. However, only a proof of basic security for this protocol has appeared. In the basic setting the adversary is assumed not to corrupt clients (thereby learning their passwords) or servers (thereby modifying the value of stored passwords). Simplifying and unifying previous work, we present a natural de nition of security which incorporates the more challenging requirement of forward secrecy. We then demonstrate via an explicit attack that the KOY protocol as originally presented is not secure under this de nition. This provides the rst natural example showing that forward secrecy is a strictly stronger requirement for PAKE protocols. Finally, we present a slight modi cation to the KOY protocol which prevents the attack and | as the main technical contribution of this paper | rigorously prove that the modi ed protocol achieves forward secrecy.